The complexity of cover inequality separation 1
نویسندگان
چکیده
Crowder et al. (Oper. Res. 31 (1983) 803–834) conjectured that the separation problem for cover inequalities for binary integer programs is polynomially solvable. We show that the general problem is NP-hard but a special case is solvable in linear time. c © 1998 Elsevier Science B.V. All rights reserved.
منابع مشابه
A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems
We present an exact separation scheme for identifying most violated extended cover inequalities for application to multidimensional knapsack problems (MKP). The minimality of the resulting covers is shown to be a basic property of the criterion used for separation, namely the ratio between leftand right-hand sides of the extended cover inequality looked for. Computational results obtained on a ...
متن کاملAsymptotic Analysis of Binary Gas Mixture Separation by Nanometric Tubular Ceramic Membranes: Cocurrent and Countercurrent Flow Patterns
Analytical gas-permeation models for predicting the separation process across membranes (exit compositions and area requirement) constitutes an important and necessary step in understanding the overall performance of membrane modules. But, the exact (numerical) solution methods suffer from the complexity of the solution. Therefore, solutions of nonlinear ordinary differential equations th...
متن کاملPolytopes Associated with Symmetry Handling
This paper investigates a polyhedral approach to handle symmetries in mixed-binary programs. We study symretopes, i.e., the convex hulls of all binary vectors that are lexicographically maximal in their orbit with respect to the symmetry group. These polytopes turn out to be quite complex. For practical use, we therefore develop an integer programming formulation with ternary coefficients, base...
متن کاملSimultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes
Cover inequalities are commonly used cutting planes for the 0–1 knapsack problem. This paper describes a linear-time algorithm (assuming the knapsack is sorted) to simultaneously lift a set of variables into a cover inequality. Conditions for this process to result in valid and facet-defining inequalities are presented. In many instances, the resulting simultaneously lifted cover inequality can...
متن کاملPrimal separation for 0/1 polytopes
The 0/1 primal separation problem is: Given an extreme point x̄ of a 0/1 polytope P and some point x , find an inequality which is tight at x̄, violated by x and valid for P or assert that no such inequality exists. It is known that this separation variant can be reduced to the standard separation problem for P. We show that 0/1 optimization and 0/1 primal separation are polynomial time equivalen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995